Kekulé Cells for Molecular Computation
نویسندگان
چکیده
The configurations of single and double bonds in polycyclic hydrocarbons are abstracted as Kekulé states of graphs. Sending a socalled soliton over an open channel between ports (external nodes) of the graph changes the Kekulé state and therewith the set of open channels in the graph. This switching behaviour is proposed as a basis for molecular computation. The proposal is highly speculative but may have tremendous impact. Kekulé states with the same boundary behaviour (port assignment) can be regarded as equivalent. This gives rise to the abstraction of Kekulé cells. The basic theory of Kekulé states and Kekulé cells is developed here, up to the classification of Kekulé cells with ≤ 4 ports. To put the theory in context, we generalize Kekulé states to semi-Kekulé states, which form the solutions of a linear system of equations over the field of the bits 0 and 1. We briefly study so-called omniconjugated graphs, in which every port assignment of the right signature has a Kekulé state. Omniconjugated graphs may be useful as connectors between computational elements. We finally investigate some examples with potentially useful switching behaviour.
منابع مشابه
NP-completeness of anti-Kekulé and matching preclusion problems
Anti-Kekulé problem is a concept of chemical graph theory precluding the Kekulé structure of molecules. Matching preclusion and conditional matching preclusion were proposed as measures of robustness in the event of edge failure in interconnection networks. It is known that matching preclusion problem on bipartite graphs is NP-complete. In this paper, we mainly prove that anti-Kekulé problem on...
متن کاملKekulé Structures in Fluoranthenes
Fluoranthenes are polycyclic conjugated molecules consisting of two benzenoid fragments, connected by two carbon–carbon bonds so as to form a five-membered ring. Fluoranthenes possessing Kekulé structures are classified into three types, depending on the nature of the two carbon–carbon bonds connecting the two benzenoid fragments. Either both these bonds are essentially single (i. e., single in...
متن کاملComputing the Permanent of the Adjacency Matrix for Fullerenes
Motivation. Novel carbon allotropes, with finite molecular structure, including spherical fullerenes are nowadays currently produced and investigated. These compounds have beautiful architectures and show unusual properties that are very promising for the development of nanotechnologies. The Kekulé structure count and permanent of the adjacency matrix are computed for these molecules. Method. A...
متن کاملTheoretical computation of the quantum transport of zigzag mono-layer Graphenes with various z-direction widths
The quantum transport computations have been carried on four different width of zigzag graphene using a nonequilibrium Green’s function method combined with density functional theory. The computed properties are included transmittance spectrum, electrical current and quantum conductance at the 0.3V as bias voltage. The considered systems were composed from one-layer graphene sheets differing w...
متن کاملTheoretical computation of the quantum transport of zigzag mono-layer Graphenes with various z-direction widths
The quantum transport computations have been carried on four different width of zigzag graphene using a nonequilibrium Green’s function method combined with density functional theory. The computed properties are included transmittance spectrum, electrical current and quantum conductance at the 0.3V as bias voltage. The considered systems were composed from one-layer graphene sheets differing w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/0704.2282 شماره
صفحات -
تاریخ انتشار 2007